A C++11 implementation of arbitrary-rank tensors for high-performance computing
نویسندگان
چکیده
منابع مشابه
A C++11 implementation of arbitrary-rank tensors for high-performance computing
This article discusses an efficient implementation of tensors of arbitrary rank by using some of the idioms introduced by the recently published C++ ISO Standard (C++11). With the aims at providing a basic building block for high-performance computing, a single Array class template is carefully crafted, from which vectors, matrices, and even higher-order tensors can be created. An expression te...
متن کاملComputing symmetric rank for symmetric tensors
We consider the problem of determining the symmetric tensor rank for symmetric tensors with an algebraic geometry approach. We give algorithms for computing the symmetric rank for 2 × · · · × 2 tensors and for tensors of small border rank. From a geometric point of view, we describe the symmetric rank strata for some secant varieties of Veronese varieties.
متن کاملStructural equations for Killing tensors of arbitrary rank
An algorithm is given for bringing the equations of monomial first integrals of arbitrary degree of the geodesic motion in a Riemannian space Vn into the form (FA) k = ∑ B ΓkABFB . The FA are the components of a Killing tensor Ki1...ir of arbitrary rank r and its symmetrized covariant derivatives. Explicit formulas are given for rank 1,2 and 3. Killing tensor equations in structural form allow ...
متن کاملEfficient Decomposition of High-Rank Tensors
Tensors are a natural way to express correlations among many physical variables, but storing tensors in a computer naively requires memory which scales exponentially in the rank of the tensor. This is not optimal, as the required memory is actually set not by the rank but by the mutual information amongst the variables in question. Representations such as the tensor tree perform near-optimally ...
متن کاملApproximation of High-Dimensional Rank One Tensors *
Many real world problems are high-dimensional in that their solution is a function which depends on many variables or parameters. This presents a computational challenge since traditional numerical techniques are built on model classes for functions based solely on smoothness. It is known that the approximation of smoothness classes of functions suffers from the so-called ‘curse of dimensionali...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2014
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2014.07.015